infeasibly


infeasibly
непомерно
infeasibly large непомерно большой

English-Russian dictionary of scientific and technical difficulties vocabulary. . 2007.

Смотреть что такое "infeasibly" в других словарях:

  • infeasibly — See infeasibility. * * * …   Universalium

  • MinHash — In computer science, MinHash (or the min wise independent permutations locality sensitive hashing scheme) is a technique for quickly estimating how similar two sets are. The scheme was invented by Andrei Broder (1997),[1] and initially used… …   Wikipedia

  • Zero-knowledge proof — In cryptography, a zero knowledge proof or zero knowledge protocol is an interactive method for one party to prove to another that a (usually mathematical) statement is true, without revealing anything other than the veracity of the statement.A… …   Wikipedia

  • Speedrun — A speedrun (IPA: IPA|/ˈspiːdˌɹʌn/) is a play through, or recording thereof, of a computer or video game performed with the intent of completing it as quickly as possible, optionally under certain prerequisites, mainly for the purposes of… …   Wikipedia

  • Delta-v budget — (or velocity change budget) is an astrogation term used in astrodynamics and aerospace industry for total delta v (or total velocity change) requirements for the various propulsive tasks and orbital maneuvers over phases of a space mission.… …   Wikipedia

  • Theodor Goldstücker — (January 18, 1821 ndash; March 6, 1872) was a German Sanskrit scholar. He was born of Jewish parents in Königsberg. After attending the gymnasium of that town, he entered its university in 1836 as a student of Sanskrit.In 1838 he removed to Bonn …   Wikipedia

  • Initrd — The initial ramdisk, or initrd is a temporary file system commonly used by the Linux kernel during boot [http://www.debian.org/doc/manuals/reference/ch kernel.en.html initrd is not needed for a kernel compiled only for one machine] . The initrd… …   Wikipedia


Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»

We are using cookies for the best presentation of our site. Continuing to use this site, you agree with this.